Improved Edge-Coloring with Three Colors
نویسنده
چکیده
We show an O(1.344) = O(2) algorithm for edge-coloring an n-vertex graph using three colors. Our algorithm uses polynomial space. This improves over the previous, O(2) algorithm of Beigel and Eppstein [1]. We apply a very natural approach of generating inclusion-maximal matchings of the graph. The time complexity of our algorithm is estimated using the “measure and con-
منابع مشابه
Edge-Coloring Cliques with Three Colors on All 4-Cliques
A coloring of the edges of Kn is constructed such that every copy of K4 has at least three colors on its edges. As n → ∞, the number of colors used is eO( √ log n ). This improves upon the previous probabilistic bound of O( √ n ) due to Erdős and Gyárfás.
متن کاملStrong chromatic index of graphs: a short survey
A strong edge coloring of a graph G is an edge coloring such that every two adjacent edges or two edges adjacent to a same edge receive two distinct colors; in other words, every path of length three has three distinct colors in G. The strong chromatic index of G, denoted by S G , is the smallest integer k such that G admits a strong edge coloring with k colors. This survey is an brief i...
متن کاملAcyclic chromatic index of triangle-free 1-planar graphs
An acyclic edge coloring of a graph G is a proper edge coloring such that every cycle is colored with at least three colors. The acyclic chromatic index χa(G) of a graph G is the least number of colors in an acyclic edge coloring of G. It was conjectured that χa(G) ≤ ∆(G) + 2 for any simple graph G with maximum degree ∆(G). A graph is 1-planar if it can be drawn on the plane such that every edg...
متن کاملFurther result on acyclic chromatic index of planar graphs
An acyclic edge coloring of a graph G is a proper edge coloring such that every cycle is colored with at least three colors. The acyclic chromatic index χa(G) of a graph G is the least number of colors in an acyclic edge coloring of G. It was conjectured that χa(G) ≤ ∆(G) + 2 for any simple graph G with maximum degree ∆(G). In this paper, we prove that every planar graph G admits an acyclic edg...
متن کاملA note on interval edge-colorings of graphs
An edge-coloring of a graph G with colors 1, 2, . . . , t is called an interval t-coloring if for each i ∈ {1, 2, . . . , t} there is at least one edge of G colored by i, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. In this paper we prove that if a connected graph G with n vertices admits an interval t-coloring, then t ≤ 2n − 3. We also show...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006